Math 171: Problem Set 7 Solutions

نویسنده

  • CHRIS HENDERSON
چکیده

And hence d(x, 0) ≥ lim inf d(0, xn)− lim sup d(xn, x) = 1 Thus x ∈ S. Hence S is closed. Clearly S is bounded since it is contained in B2(0). Define en = (0, 0, . . . , 0, 1, 0, . . . ) be the sequence with all 0’s except a 1 in the nth place. Notice that en ∈ S (for `, `∞, c0). However, notice also that since, in every case, d(en, em) ≥ 1 whenever n 6= m, then the sequence en has no convergent subsequence in `, `∞, and c0. Hence, by Theorem 43.5, S is not compact.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solutions and optimality criteria for nonconvex quadratic-exponential minimization problem

This paper presents a set of complete solutions and optimality conditions for a nonconvex quadratic-exponential optimization problem. By using the canonical duality theory developed by the first author, the nonconvex primal problem in n-dimensional space can be converted into an one-dimensional canonical dual problem with zero duality gap, which can be solved easily to obtain all dual solutions...

متن کامل

An Efficient Genetic Algorithm to Solve the Intermodal Terminal Location problem

The exponential growth of the flow of goods and passengers, fragility of certain products and the need for the optimization of transport costs impose on carriers to use more and more multimodal transport. In addition, the need for intermodal transport policy has been strongly driven by environmental concerns and to benefit from the combination of different modes of transport to cope with the in...

متن کامل

The Number of Solutions Sufficient for Solving a Family of Problems

This paper deals with families of optimization problems defined over a common set of potential solutions. We consider several problems-solutions systems, and for each one, prove the existence of a small set of solutions that contains an optimal solution to every problem. These proofs are mostly algebraic in nature. The families of problems covered here mostly include separation problems, proble...

متن کامل

Linear passive systems and maximal monotone mappings

This paper deals with a class of dynamical systems obtained from interconnecting linear systems with static set-valued relations. We first show that such an interconnection can be described by a differential inclusions with a maximal monotone set-valued mappings when the underlying linear system is passive and the static relation is maximal monotone. Based on the classical results on such diffe...

متن کامل

Generic properties of the complementarity problem

Given f: Rn+ ~ R n, the complementarity problem is to find a solution to x > O, f(x) >_ 0, and (x, f(x)) = 0. Under the condition that fis continuously differentiable, we prove that for a generic set of such an f, the problem has a discrete solution set. Also, under a set of generic non-degeneracy conditions and a condition that implies existence, we prove that the problem has an odd number of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012